Vulnerability analysis of cut-capacity structure and OD demand using Gomory-Hu tree method

Vulnerability analysis of transportation networks has rapidly become important in recent decades given the increasing numbers disasters. In this paper, we describe a method for calculating minimum cuts between all pairs nodes network and develop two indices analyzing vulnerability; these are derived from topology-based vulnerability/demand-accountable analyses enable evaluation without assuming route-choice behaviors. We show that such can be performed using Gomory–Hu tree to reduce computational load. This is efficient, requiring only N − 1 calculations maximum flow problem even though number node N2, where nodes. addition, total demand passing each cut, which necessary demand-accountable analysis, obtained by loading onto features. apply proposed central region Japan illustrate applicability identifying vulnerable links road network.